package SortAlgotithm;

/**
 * Created by lenovo】 on 2017/4/6.
 */
public class MergeSorter {
    public void mergeSorter(int []data, int right, int left) {
        if (right >= left) {
            return;
        }
        // 拆分
        int mid = (right + left) / 2;
        mergeSorter(data, right, mid);
        mergeSorter(data, mid + 1, left);
        // 合并
        for (int i : data) {
            System.out.print(i + " ");
        }
        System.out.println("");
        merge(data, right, mid, left);
    }
    public void merge(int []data, int right, int mid, int left) {

    }
}
